Explicit expanders with cutoff phenomena
نویسندگان
چکیده
The cutoff phenomenon describes a sharp transition in the convergence of an ergodic finite Markov chain to equilibrium. Of particular interest is understanding this convergence for the simple random walk on a bounded-degree expander graph. The first example of a family of bounded-degree graphs where the random walk exhibits cutoff in total-variation was provided only very recently, when the authors showed this for a typical random regular graph. However, no example was known for an explicit (deterministic) family of expanders with this phenomenon. Here we construct a family of cubic expanders where the random walk from a worst case initial position exhibits total-variation cutoff. Variants of this construction give cubic expanders without cutoff, as well as cubic graphs with cutoff at any prescribed time-point.
منابع مشابه
An Explicit Construction of Quantum Expanders
Quantum expanders are a natural generalization of classical expanders. These objects were introduced and studied by [1, 3, 4]. In this note we show how to construct explicit, constant-degree quantum expanders. The construction is essentially the classical Zig-Zag expander construction of [5], applied to quantum expanders.
متن کاملExplicit Unique-Neighbor Expanders
We present a simple, explicit construction of an infinite family F of bounded-degree ’unique-neighbor’ expanders Γ; i.e., there are strictly positive constants α and , such that all Γ = (X,E(Γ)) ∈ F satisfy the following property. For each subset S of X with no more than α|X| vertices, there are at least |S| vertices in X \ S that are adjacent in Γ to exactly one vertex in S. The construction o...
متن کاملSystolic Expanders of Every Dimension
In recent years a high dimensional theory of expanders has emerged. The notion of combinatorial expanders of graphs (i.e. the Cheeger constant of a graph) has seen two generalizations to high dimensional simplicial complexes. One generalization, known as coboundary expansion is due to Linial and Meshulem; the other, which we term here systolic expansion, is due to Gromov, who showed that systol...
متن کاملEigenvalues, Expanders and Superconcentrators
Explicit construction of families of linear expanders and superconcentrators is relevant to theoretical computer science in several ways. There is essentially only one known explicit construction. Here we show a correspondence between the eigenvalues of the adjacency matrix of a graph and its expansion properties, and combine it with results on Group Representations to obtain many new examples ...
متن کاملSymmetric Groups and Expanders
We construct an explicit generating sets Fn and F̃n of the alternating and the symmetric groups, which make the Cayley graphs C(Alt(n), Fn) and C(Sym(n), F̃n) a family of bounded degree expanders for all sufficiently large n. These expanders have many applications in the theory of random walks on groups and other areas of mathematics. A finite graph Γ is called an ǫ-expander for some ǫ ∈ (0, 1), ...
متن کامل